An Aggregation-Based Algebraic Multigrid Method with Deflation Techniques and Modified Generic Factored Approximate Sparse Inverses
نویسندگان
چکیده
In this paper, we examine deflation-based algebraic multigrid methods for solving large systems of linear equations. Aggregation the unknown terms is applied coarsening, while deflation techniques are proposed improving rate convergence. More specifically, V-cycle strategy adopted, in which, at each iteration, solution computed by initially decomposing it utilizing two complementary subspaces. The approximate formed combining obtained using multigrids and deflation. order to improve performance convergence behavior, scheme was coupled with Modified Generic Factored Approximate Sparse Inverse preconditioner. Furthermore, a parallel version multicore systems, techniques. Finally, characteristic model problems solved demonstrate applicability schemes, numerical results given.
منابع مشابه
Numerical study of the performance of preconditioners based on algebraic multigrid method and approximate sparse inverses
Application of algebraic multigrid method and approximate sparse inverses are applied as preconditioners for large algebraic systems arising in approximation of diffusion-reaction problems in 3-dimensional complex domains. Here we report the results of numerical experiments when using highly graded and locally refined meshes for problems with non-homogeneous and anisotropic coefficients that ha...
متن کاملOrdering, Anisotropy, and Factored Sparse Approximate Inverses
We consider ordering techniques to improve the performance of factored sparse approximate inverse preconditioners, concentrating on the AINV technique of M. Benzi and M. Tůma. Several practical existing unweighted orderings are considered along with a new algorithm, minimum inverse penalty (MIP), that we propose. We show how good orderings such as these can improve the speed of preconditioner c...
متن کاملAn aggregation-based algebraic multigrid method
An algebraic multigrid method is presented to solve large systems of linear equations. The coarsening is obtained by aggregation of the unknowns. The aggregation scheme uses two passes of a pairwise matching algorithm applied to the matrix graph, resulting in most cases in a decrease of the number of variables by a factor slightly less than four. The matching algorithm favors the strongest nega...
متن کاملAlgebraic Multilevel Methods and Sparse Approximate Inverses
In this paper we introduce a new approach to algebraic multilevel methods and their use as preconditioners in iterative methods for the solution of symmetric positive definite linear systems. The multilevel process and in particular the coarsening process is based on the construction of sparse approximate inverses and their augmentation with corrections of smaller size. We present comparisons o...
متن کاملAn Algebraic Multilevel Method for Sparse Approximate Inverses Based on Norm Minimization
We present an algebraic multilevel method that is based on sparse approximate inverse matrices. The approach is based on the observation that sparse approximate inverses based on norm minimization [4,3,2] can easily be adapted such that they approximate the operator quite well on a large subspace. A natural consequence is to augment the sparse approximate inverse with a correction term of small...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11030640